Appli ation of Finite QBD - M Pro ess to Analysis of a Queuewith two Priority
نویسندگان
چکیده
منابع مشابه
How Fast is ‘-fast’? Performance Analysis of KDD Applications using Hardware Performance Counters on UltraSPARC-III
ABSTRACT Modern pro essors and omputer systems are designed to be eÆ ient and a hieve high performan e with appli ations that have regular memory a ess patterns. For example, dense linear algebra routines an be implemented to a hieve near peak performan e. While su h routines have traditionally formed the ore of many s ienti and engineering appli ations, ommer ial workloads like database and we...
متن کاملOrdered SOS Pro ess Languages for Bran hing and Eager Bisimulations
Bran hing and Eager Bisimulations Irek Ulidowski a, Iain Phillips b;1 aDepartment of Mathemati s and Computer S ien e, University of Lei ester, University Road, Lei ester, LE1 7RH, United Kingdom bDepartment of Computing, Imperial College, 180 Queen's Gate, London SW7 2BZ, United Kingdom Abstra t We present a general and uniform method for de ning stru tural operational semanti s (SOS) of pro e...
متن کاملThe Regular Viewpoint on PA - Pro esses
To appear in Theoretical Computer Science The Regular Viewpoint on PA-Pro esses D. Lugiez Lab. d'Informatique de Marseille, Univ. Aix-Marseille & CNRS URA 1787, 39, r. Joliot-Curie, 13453 Marseille Cedex 13, FRANCE and Ph. S hnoebelen Lab. Spe i ation and Veri ation, ENS de Ca han & CNRS UMR 8643, 61 av. Pdt Wilson, 94235 Ca han Cedex, FRANCE Abstra t PA is the pro ess algebra allowing non-dete...
متن کاملÙ Blockinøøóò Óò Åä Ó Blockinùññòø×× ×× Ëøùùý
Bernd D. Heumesser and Ralf-Dieter S himkat Wilhelm-S hi kard-Institute for Computer S ien e University of T ubingen, Germany fheumesser, s himkatg informatik.uni-tuebingen.de Abstra t This papers shows the deployment of the pro essing and omputational fa ilities of Prolog to query on XML do uments and to reason about their ontent. Based on a ase study we show that it is feasible and useful to...
متن کاملReachability-Based Memory Accounting
Many language implementations provide a me hanism to express on urrent pro esses, but few provide support for terminating a pro ess based on its resour e onsumption. Those implementations that do support termination generally harge the ost of a resour e to the prin ipal that allo ates the resour e, rather than the prin ipal that retains the resour e. The di eren e matters if prin ipals represen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000